Nonabelian Groups with Perfect Order Subsets
نویسنده
چکیده
Let G be a finite group and let x ∈ G. Define the order subset of G determined by x to be the set of all elements in G that have the same order as x. A group G is said to have perfect order subsets if the number of elements in each order subset of G is a divisor of |G|. In this article we prove a theorem for a class of nonabelian groups, which is analogous to Theorem 4 in [2]. We then prove that there are infinitely many nonabelian groups with perfect order subsets. In addition, all values of q are determined such that the special linear group, SL(2,q), has perfect order subsets. Next, we give a discussion of some necessary conditions for general nonabelian groups to have perfect order subsets. We conclude by stating some conjectures.
منابع مشابه
A Refined Waring Problem for Finite Simple Groups
Let w1 and w2 be nontrivial words in free groups Fn1 and Fn2 , respectively. We prove that, for all sufficiently large finite nonabelian simple groups G, there exist subsets C1 ⊆ w1(G) and C2 ⊆ w2(G) such that |Ci | = O(|G|1/2 log |G|) and C1C2 = G. In particular, ifw is any nontrivial word and G is a sufficiently large finite nonabelian simple group, then w(G) contains a thin base of order 2. ...
متن کاملOn Groups with Perfect Order Subsets
A finite group G is said to have Perfect Order Subsets if for every d, the number of elements of G of order d (if there are any) divides |G|. This notion was introduced in the paper [1] by C. Finch and L. Jones. In the case of finite Abelian groups, the authors reduced the problem of which groups have this property to the case of groups of the form G = ∏k i=1(Z/piZ) ai , where pi are primes and...
متن کاملSimple groups with the same prime graph as $D_n(q)$
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
متن کاملFinite Simple Groups with Narrow Prime Spectrum
We find the nonabelian finite simple groups with order prime divisors not exceeding 1000. More generally, we determine the sets of nonabelian finite simple groups whose maximal order prime divisor is a fixed prime less than 1000. Our results are based on calculations in the computer algebra system GAP.
متن کاملON COMPOSITION FACTORS OF A GROUP WITH THE SAME PRIME GRAPH AS Ln(5)
The prime graph of a finite group $G$ is denoted by$ga(G)$. A nonabelian simple group $G$ is called quasirecognizable by primegraph, if for every finite group $H$, where $ga(H)=ga(G)$, thereexists a nonabelian composition factor of $H$ which is isomorphic to$G$. Until now, it is proved that some finite linear simple groups arequasirecognizable by prime graph, for instance, the linear groups $L_...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010